Edge Coloring by Total Labelings of 4-regular Circulant Graphs
نویسندگان
چکیده
Edge-coloring total k-labeling of a connected graph G is an assignment f of non negative integers to the vertices and edges of G such that two adjacent edges e = uv and e = uv of G have different weights. The weight of an edge uv is defined by: w(e = uv) = f(u) + f(v) + f(e). In this paper, we study the chromatic number of the edge coloring by total labeling of 4-regular circulant graphs Cn(1, k).
منابع مشابه
Total and fractional total colourings of circulant graphs
In this paper, the total chromatic number and fractional total chromatic number of circulant graphs are studied. For cubic circulant graphs we give upper bounds on the fractional total chromatic number and for 4-regular circulant graphs we find the total chromatic number for some cases and we give the exact value of the fractional total chromatic number in most cases.
متن کاملOn the cyclic decomposition of circulant graphs into bipartite graphs
It is known that if a bipartite graph G with n edges possesses any of three types of ordered labelings, then the complete graphK2nx+1 admits a cyclic G-decomposition for every positive integer x. We introduce variations of the ordered labelings and show that whenever a bipartite graph G admits one of these labelings, then there exists a cyclic G-decomposition of an infinite family of circulant ...
متن کاملRainbow regular order of graphs
Assume that the vertex set of the complete graph Kt is Zt if t is odd and Zt−1 ∪ {∞} otherwise, with convention that x +∞ = 2x. If the color of any edge xy is defined to be x+ y then GKt stands for Kt together with the resulting edge coloring. Hence color classes are maximum matchings rotationally/cyclically generated if t is even/odd. A rainbow subgraph of GKt has all edges with distinct color...
متن کاملConstructions of antimagic labelings for some families of regular graphs
In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.
متن کاملOn Regular Graphs Optimally Labeled with a Condition at Distance Two
For positive integers j ≥ k, the λj,k-number of graph G is the smallest span among all integer labelings of V (G) such that vertices at distance two receive labels which differ by at least k and adjacent vertices receive labels which differ by at least j. We prove that the λj,k-number of any r-regular graph is no less than the λj,k-number of the infinite r-regular tree T∞(r). Defining an r-regu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 41 شماره
صفحات -
تاریخ انتشار 2013